The enumeration of irreducible combinatorial objects
نویسندگان
چکیده
منابع مشابه
Fast Enumeration of Combinatorial Objects
The problem of ranking (or perfect hashing) is well known in Combinatorial Analysis, Computer Science, and Information Theory. There are widely used methods for ranking permutations of numbers {1, 2, ..., n}, n ≥ 1, for ranking binary words of length n with a fixed number of ones and for many other combinatorial problems. Many of these methods have nonexponential memory size and the time of enu...
متن کاملEnumeration of inequivalent irreducible Goppa codes
We consider irreducible Goppa codes over Fq of length q n defined by polynomials of degree r where q is a prime power and n, r are arbitrary positive integers. We obtain an upper bound on the number of such codes.
متن کاملCombinatorial Polytope Enumeration
We describe a provably complete algorithm for the generation of a tight, possibly exact, superset of all combinatorially distinct simple n-facet polytopes in Rd, along with their graphs, f -vectors, and face lattices. The technique applies repeated cutting planes and planar sweeps to a d−simplex. Our generator has implications for several outstanding problems in polytope theory, including conje...
متن کاملAutomatic Enumeration of Regular Objects
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These differential equations are then used to determine the initial terms in the counting sequence and for asymptotic analysis. The key tool is the scalar product for...
متن کاملA Step-by-Step Extending Parallelism Approach for Enumeration of Combinatorial Objects
We present a general step-by-step extending approach to parallel execution of enumeration of combinatorial objects (ECO).Themethodology extends a famous enumeration algorithm,OrderlyGeneration, which allows concurrently generating all objects of size n + 1 from all objects of size n. To the best of our knowledge, this is the first time there is an attempt to plug parallel computing into Orderly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1985
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90065-2